A coincidence problem in telephone traffic with non-recurrent arrival process
نویسندگان
چکیده
منابع مشابه
The impact of the flow arrival process in Internet traffic
Internet packet data is analysed to determine the relationship between the arrival process of packets, and of TCP flows of packets. Viewed as point processes, second order properties of the two processes are studied using wavelets, and each is found to have longrange dependence. A new result is given directly linking flow durations to the onset scale of the long range dependence in the flow pro...
متن کاملEmergency Service Vehicle Location Problem with Batch Arrival of Demands
In this paper an emergency service vehicle (ESV) location problem has been considered in which it is assumed that each emergency call may require more than one ESV. In ESV location problem two factors should be known; the location of stations and the number of ESVs at each station. Hence, a nonlinear mixed integer programming model is presented in order to maximize the total response rate to th...
متن کاملModeling IP traffic using the batch Markovian arrival process
In this paper, we show how to utilize the expectation-maximization (EM) algorithm for efficient and numerical stable parameter estimation of the batch Markovian arrival process (BMAP). In fact, effective computational formulas for the E-step of the EM algorithm are presented, which utilize the well-known randomization technique and a stable calculation of Poisson jump probabilities. Moreover, w...
متن کاملA Collector’s Problem with Renewal Arrival Processes
We study a collector’s problem withK renewal arrival processes for different type items, where the objective is to collect complete sets. In particular, we derive the asymptotic distribution of the sequence of interarrival times between set completions.
متن کاملOn A Telephone Problem
Answer. Let f(n) be the minimum number of calls needed for n people. It is easily shown that f(1) = 0, f(2) = 1, f(3) = 3 and f(4) = 4. For n > 4, 2n− 4 calls are sufficient according to the following procedure: one of four “chief” gossips first calls each of the remaining n− 4 gossips, then the four learn each other’s (and hence everyone’s) information in 4 calls (as f(4) = 4), and finally one...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Australian Mathematical Society
سال: 1963
ISSN: 0004-9735
DOI: 10.1017/s144678870002797x